Eliminating internal behaviour in Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 411-425, issn 0302-9743, isbn 3-540-22236-7, 15 p.Conference Paper

On the impossibility of a generalization of the HOMFLY : Polynomial to labelled oriented graphsCHRISTENSEN, A; ROSEBROCK, S.Annales de la faculté des sciences de Toulouse. 1996, Vol 5, Num 3, pp 407-419, issn 0240-2963Article

The corali project: From conceptual graphs to conceptual graphs via labelled graphsCHEIN, M.Lecture notes in computer science. 1997, pp 65-79, issn 0302-9743, isbn 3-540-63308-1Conference Paper

Relabelling in graph transformationHABEL, Annegret; PLUMP, Detlef.Lecture notes in computer science. 2002, pp 135-147, issn 0302-9743, isbn 3-540-44310-X, 13 p.Conference Paper

Planar separatorsALON, N; SEYMOUR, P; THOMAS, R et al.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 184-193, issn 0895-4801Article

Cycles through specified verticesBOLLOBAS, B; BRIGHTWELL, G.Combinatorica (Print). 1993, Vol 13, Num 2, pp 147-155, issn 0209-9683Article

On the number of labeled acyclic digraphsRODIONOV, V. I.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 319-321, issn 0012-365XArticle

Circular permutation graph family with applications : Discrete algorithms and complexityLOU, R. D; SARRAFZADEH, M.Discrete applied mathematics. 1992, Vol 40, Num 3, pp 433-457, issn 0166-218XArticle

Asymptotic enumeration by degree sequence of graphs with degrees o(n^1/2)MCKAY, B. D; WORMALD, N. C.Combinatorica (Print). 1991, Vol 11, Num 4, pp 369-382, issn 0209-9683Article

On the minimum label spanning tree problemKRUWKE, S. O; WIRTH, H.-C.Information processing letters. 1998, Vol 66, Num 2, pp 81-85, issn 0020-0190Article

Polyèdres avec un nombre fini de types de sommets = Polyhedra with a finite set of types of verticesBENAKLI, N.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 317, Num 9, pp 863-866, issn 0764-4442Article

Mahonian statistics on labeled forestsLIANG, K; WACHS, M. L.Discrete mathematics. 1992, Vol 99, Num 1-3, pp 181-197, issn 0012-365XArticle

Regular integral sum graphsMELNIKOV, L. S; PYATKIN, A. V.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 237-245, issn 0012-365XArticle

Labeling schemes for dynamic tree networksKORMAN, Amos; PELEG, David; RODEH, Yoav et al.Lecture notes in computer science. 2002, pp 76-87, issn 0302-9743, isbn 3-540-43283-3Conference Paper

Lower bounds for embedding graphs into graphs of smaller characteristicNAIDU, K. V. M; RAMESH, H.Lecture notes in computer science. 2002, pp 301-310, issn 0302-9743, isbn 3-540-00225-1, 10 p.Conference Paper

Speech recognition using randomized relational decision treesAMIT, Yali; MURUA, Alejandro.IEEE transactions on speech and audio processing. 2001, Vol 9, Num 4, pp 333-341, issn 1063-6676Article

A note on the construction of marked graphsTHIRUSANGU, K; RANGARAJAN, K.Information processing letters. 1995, Vol 55, Num 4, pp 211-215, issn 0020-0190Article

Surjective extensions of sliding-block codesASHLEY, J; MARCUS, B; PERRIN, D et al.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 4, pp 582-611, issn 0895-4801Article

A new bijection on rooted forestsERDOS, P. L.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 179-188, issn 0012-365XConference Paper

Rapport sur la théorie classique des nœuds. II = Report on the classical theory of knots. IIGRAMAIN, A.Astérisque. 1991, Num 201-03, pp 89-113, issn 0303-1179Article

Enumeration of difference graphsPELED, U. N; SUN, F.Discrete applied mathematics. 1995, Vol 60, Num 1-3, pp 311-318, issn 0166-218XArticle

Enumeration of acyclic walks in a graphBABIC, D; GRAOVAC, A.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 117-123, issn 0166-218XArticle

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

On the clique-width of graphs in hereditary classesBOLIAC, Rodica; LOZIN, Vadim.Lecture notes in computer science. 2002, pp 44-54, issn 0302-9743, isbn 3-540-00142-5, 11 p.Conference Paper